Path-Based Approach to Random Walks on Networks Characterizes How Proteins Evolve New Functions
نویسندگان
چکیده
منابع مشابه
A path-based approach to random walks on networks characterizes how proteins evolve new function
We develop a path-based approach to continuous-time random walks on networks with arbitrarily weighted edges. We describe an efficient numerical algorithm for calculating statistical properties of the stochastic path ensemble. After demonstrating our approach on two reaction rate problems, we present a biophysical model that describes how proteins evolve new functions while maintaining thermody...
متن کاملRandom Walks on Quasisymmetric Functions
Conditions are provided under which an endomorphism on quasisymmetric functions gives rise to a left random walk on the descent algebra which is also a lumping of a left random walk on permutations. Spectral results are also obtained. Several important random walks are now realized this way: Stanley’s QS-distribution results from endomorphisms given by evaluation maps, a-shuffles result from th...
متن کاملPath-probability density functions for semi-Markovian random walks.
In random walks, the path representation of the Green's function is an infinite sum over the length of path probability density functions (PDFs). Recently, a closed-form expression for the Green's function of an arbitrarily inhomogeneous semi-Markovian random walk in a one-dimensional (1D) chain of L states was obtained by utilizing path-PDFs calculations. Here we derive and solve, in Laplace s...
متن کاملRandom walks on temporal networks.
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various time scales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis of the temporal patterns characterizing dynamic networks are still recent, so that many questions remain open. Here, we study how random walks, as a paradigm...
متن کاملRandom Walks on Multiplex Networks
Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this letter, we extend well-known random walks to multiplexes and we introduce a new type of walk that can exist only in multiplexes. We derive exact expressions for vertex occupation time and the coverage. Finally, we show how the efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2013
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.111.088102